翻訳と辞書 Words near each other ・ Smithy Bridge railway station ・ Smithy code ・ Smithycroft Secondary School ・ Smith–Connally Act ・ Smith–Elisha House ・ Smith–Fineman–Myers syndrome ・ Smith–Hughes Act ・ Smith–Lemli–Opitz syndrome ・ Smith–Lever Act of 1914 ・ Smith–Magenis syndrome ・ Smith–Minkowski–Siegel mass formula ・ Smith–Mundt Act ・ Smith–Ninth Streets (IND Culver Line) ・ Smith–Purcell effect ・ Smith–Volterra–Cantor set ・ Smith–Waterman algorithm ・ Smith–Wills Stadium ・ Smitilbin ・ Smitinandia ・ Smiting-blade symbol (hieroglyph) ・ Smitley River ・ Smits ・ Smitten ・ Smitten (Buffalo Tom album) ・ Smitten (The Martinis album) ・ Smitten Kitchen ・ Smitten Kitten ・ Smitthi Bhiraleus ・ Smittia ・ Smittinidae Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Smith–Waterman algorithm ： ウィキペディア英語版 Smith–Waterman algorithm The Smith–Waterman algorithm performs local sequence alignment; that is, for determining similar regions between two strings or nucleotide or protein sequences. Instead of looking at the total sequence, the Smith–Waterman algorithm compares segments of all possible lengths and optimizes the similarity measure. The algorithm was first proposed by Temple F. Smith and Michael S. Waterman in 1981. Like the Needleman–Wunsch algorithm, of which it is a variation, Smith–Waterman is a dynamic programming algorithm. As such, it has the desirable property that it is guaranteed to find the optimal local alignment with respect to the scoring system being used (which includes the substitution matrix and the gap-scoring scheme). The main difference to the Needleman–Wunsch algorithm is that negative scoring matrix cells are set to zero, which renders the (thus positively scoring) local alignments visible. Backtracking starts at the highest scoring matrix cell and proceeds until a cell with score zero is encountered, yielding the highest scoring local alignment. One does not actually implement the algorithm as described because improved alternatives are now available that have better scaling (Gotoh, 1982) and are more accurate (Altschul and Erickson, 1986). ==Explanation== A matrix $H$ is built as follows: $$ H(i,0) = 0,\; 0\le i\le m $$ H(0,j) = 0,\; 0\le j\le n $H(i,j)\; =\; \backslash max\; \backslash begin$ 0 \\ H(i-1,j-1) + \ s(a_i,b_j) & \text \\ \max_ \ & \text \\ \max_ \ & \text \end ,\; 1\le i\le m, 1\le j\le n Where: * $a,\; b$ = Strings over the Alphabet $\backslash Sigma$ * $m\; =\; \backslash text(a)$ * $n\; =\; \backslash text(b)$ * $s(a,b)$ is a similarity function on the alphabet * $H(i,j)$ – is the maximum Similarity-Score between a suffix of a() and a suffix of b() * $W\_i$ is the gap-scoring scheme 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Smith–Waterman algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.